On Generalized Weight Nash Equilibria for Generalized Multiobjective Games
نویسندگان
چکیده
In this paper, we will introduce the general concepts of generalized multiobjective game, generalized weight Nash equilibria and generalized Pareto equilibria. Next using the fixed point theorems due to Idzik [5] and Kim-Tan [6], we shall prove the existence theorems of generalized weight Nash equilibria under general hypotheses. And as applications of generalized weight Nash equilibria, we shall prove the existence of generalized Pareto equilibria in non-compact generalized multiobjective game.
منابع مشابه
Projected-gradient algorithms for generalized equilibrium seeking in Aggregative Games are preconditioned Forward-Backward methods
We show that projected-gradient methods for the distributed computation of generalized Nash equilibria in aggregative games are preconditioned forward-backward splitting methods applied to the KKT operator of the game. Specifically, we adopt the preconditioned forward-backward design, recently conceived by Yi and Pavel in the manuscript “A distributed primal-dual algorithm for computation of ge...
متن کاملMultiobjective Games and Determining Pareto-Nash Equilibria
We consider the multiobjective noncooperative games with vector payoff functions of players. Pareto-Nash equilibria conditions for such class of games are formulated and algorithms for determining Pareto-Nash equilibria are proposed. Mathematics subject classification: 90B10, 90C35, 90C27.
متن کاملStability of Weakly Pareto-Nash Equilibria and Pareto-Nash Equilibria for Multiobjective Population Games
Using the method of generic continuity of set-valued mappings, this paper studies the stability of weakly Pareto-Nash and Pareto-Nash equilibria for multiobjective population games, when payoff functions are perturbed. More precisely, the paper investigates the continuity properties of the set of weakly Pareto-Nash equilibria and that of the set of Pareto-Nash equilibria under sufficiently smal...
متن کاملComputing Nash Equilibria in Generalized Interdependent Security Games
We study the computational complexity of computing Nash equilibria in generalized interdependent-security (IDS) games. Like traditional IDS games, originally introduced by economists and risk-assessment experts Heal and Kunreuther about a decade ago, generalized IDS games model agents’ voluntary investment decisions when facing potential direct risk and transfer-risk exposure from other agents....
متن کاملMonotone operator methods for Nash equilibria in non-potential games
We observe that a significant class of Nash equilibrium problems in non-potential games can be associated with monotone inclusion problems. We propose splitting techniques to solve such problems and establish their convergence. Applications to generalized Nash equilibria, zero-sum games, and cyclic proximation problems are demonstrated.
متن کامل